20th International Congress on Modelling and Simulation, Adelaide, Australia, 1–6 December 2013 www.mssanz.org.au/modsim2013 Multifractal analysis of wind farm power output L. McArthur a , S. Mackenzie b and J. Boland

Source URL: www.mssanz.org.au

• Dimension
• Dimension theory
• Time series analysis
• Dynamical systems
• Detrended fluctuation analysis
• Hurst exponent
• Multifractal system
• Power law
• Fractional Brownian motion
• Statistics
• Stochastic processes
• Fractals

Published in Noûs 41(3): [removed]Reprinted in Oaklander, L.N. (ed.) Routledge Major Works: The Philosophy of Time: Critical Concepts in Philosophy v. IV (New York and London: Routledge, [removed]B-THEORY, FIXITY, A

Source URL: www.qub.ac.uk

• Metaphysics
• Determinism
• Free will
• Destiny
• Fatalism
• Argument from free will
• Philosophy of space and time
• Omniscience
• Indeterminism
• Philosophy
• Time
• Causality

May 21, [removed]Spring 2008 Final Exam Introduction to Algorithms Massachusetts Institute of Technology

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Binary trees
• Asymptotic analysis
• B-tree
• Big O notation
• Time complexity
• Shortest path problem
• AVL tree
• Heap
• Theoretical computer science
• Mathematics
• Computational complexity theory

Collective Intelligence and its Implementation on the Web: algorithms to develop a collective mental map Francis HEYLIGHEN * Center “Leo Apostel”, Free University of Brussels Address: Krijgskundestraat 33, B-1160 Bru

Source URL: pespmc1.vub.ac.be

• Science
• Educational psychology
• Time
• Self-organization
• Stigmergy
• Swarm behaviour
• Collective intelligence
• Ant
• Termite
• Biology
• Systems theory
• Artificial intelligence

A Linear Time Algorithm for Optimum Tree Placement Satrajit Chatterjee Zile Wei Alan Mishchenko Robert Brayton Department of EECS U. C. Berkeley {satrajit, zile, alanmi, brayton}@eecs.berkeley.edu

Source URL: www.bvsrc.org

• Binary trees
• Applied mathematics
• R-tree
• Dynamic programming
• Equations
• Systems engineering
• B-tree
• Linear programming
• Tango tree
• Mathematics
• Operations research
• Graph theory

Approximating Independent Set in Semi-Random Graphs Bodo Manthey a Kai Plociennik b a University of Twente, Department of Applied Mathematics

Source URL: doc.utwente.nl

• NP-complete problems
• Analysis of algorithms
• Approximation algorithms
• Time complexity
• Independent set
• Ε-net
• Property testing
• Theoretical computer science
• Mathematics
• Computational complexity theory

MAHARSHI DAYANAND UNIVERSITY ROHTAK Theory date sheet for B.Ed. Annual/Mercy Examination June/July, 2014 Time of Examination: 2.30 p.m. to 5.30 p.m. Centre of Examination: As per Roll No. Slip & Building Notice Date

Source URL: ssfoundationtrust.com

Towards Ecient Universal Planning|A Randomized Approach Peter Jonsson, Patrik Haslum and Christer Backstrom Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpetej,paha

Source URL: www.ida.liu.se

• Applied mathematics
• Polynomial hierarchy
• P
• SL
• L
• NC
• Time complexity
• FO
• Completeness
• Theoretical computer science
• Computational complexity theory
• Complexity classes

PHYSICAL REVIEW B 72, 245302 共2005兲 Theory of carrier dynamics and time resolved reflectivity in InxMn1−xAs/ GaSb heterostructures G. D. Sanders and C. J. Stanton Department of Physics, University of Florida, Box

Source URL: www.ece.rice.edu

• Nuclear magnetic resonance
• Relaxation
• Phonon
• Resonance
• Physics
• Particle physics
• Bosons

Mid-Semester Exam Analysis 1 Time 3:00hrs Total Marks 40 Answer any five questions, each question is worth 8marks 1. Let (an ) and (bn ) be sequences converging to a and b respectively. Prove that

Source URL: www.isibang.ac.in

• Series
• Radius of convergence
• Probability theory
• Mathematical analysis
• Convergence
• Limit superior and limit inferior